منابع مشابه
Offensive Information Warfare Revisited: Social Media Use in Man-Made Crises
No part of this journal may be reproduced or used in any form or by any means without written permission from the publisher, except for noncommercial, educational use including classroom teaching purposes. Product or company names used in this journal are for identification purposes only. Inclusion of the names of the products or companies does not indicate a claim of ownership by IGI Global of...
متن کاملMeasurement of Effectiveness for an Anti-torpedo Combat System Using a Discrete Event Systems Specification- based Underwater Warfare Simulator
Modeling and simulation (M&S) has long played an important role in developing tactics and evaluating the measure of effectiveness (MOE) for the underwater warfare system. In simulation-based acquisition, M&S technology facilitates decisions about future equipment procurements, such as a mobile decoy or a torpedo. In addition, assessment of submarine tactical development, during an engagement ag...
متن کاملSpecification-based Underwater Warfare Simulator Measurement of Effectiveness for an Anti-torpedo Combat System Using a Discrete Event System
Modeling and simulation (M&S) has long played an important role in developing tactics and evaluating the measure of effectiveness (MOE) for the underwater warfare system. In simulation-based acquisition, M&S technology facilitates decisions about future equipment procurements, such as a mobile decoy or a torpedo. In addition, assessment of submarine tactical development, during an engagement ag...
متن کاملOffensive alliances in graphs
A set S is an offensive alliance if for every vertex v in its boundary N(S)−S it holds that the majority of vertices in v’s closed neighbourhood are in S. The offensive alliance number is the minimum cardinality of an offensive alliance. In this paper we explore the bounds on the offensive alliance and the strong offensive alliance numbers (where a strict majority is required). In particular, w...
متن کاملOffensive r-alliances in graphs
Let G = (V , E) be a simple graph. For a nonempty set X ⊂ V , and a vertex v ∈ V , δX (v) denotes the number of neighbors v has in X . A nonempty set S ⊂ V is an offensive r-alliance in G if δS(v) ≥ δS̄(v)+ r,∀v ∈ ∂(S), where ∂(S) denotes the boundary of S. An offensive ralliance S is called global if it forms a dominating set. The global offensive r-alliance number of G, denoted by γ o r (G), i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Royal United Services Institution. Journal
سال: 1871
ISSN: 0035-9289
DOI: 10.1080/03071847109416526